Your Choice MATor(s) Large-scale Quantitative Anonymity Assessment of Tor Path Selection Algorithms Against Structural Attacks
نویسندگان
چکیده
In this paper, we present a rigorous methodology for quantifying the anonymity provided by Tor against a variety of structural attacks, i.e., adversaries that compromise Tor nodes and thereby perform eavesdropping attacks to deanonymize Tor users. First, we provide an algorithmic approach for computing the anonymity impact of such structural attacks against Tor. The algorithm is parametric in the considered path selection algorithm and is, hence, capable of reasoning about variants of Tor and alternative path selection algorithms as well. Second, we present formalizations of various instantiations of structural attacks against Tor and show that the computed anonymity impact of each of these adversaries indeed constitutes a worst-case anonymity bound for the cryptographic realization of Tor. Third, we use our methodology to conduct a rigorous, large-scale evaluation of Tor’s anonymity which establishes worst-case anonymity bounds against various structural attacks for Tor and for alternative path selection algorithms such as DistribuTor, SelekTOR, and LASTor. This yields the first rigorous anonymity comparison between different path selection algorithms. As part of our analysis, we quantify the anonymity impact of a path selection transition phase, i.e., a small number of users decides to run an alternative algorithm while the vast majority still uses the original one. The source code of our implementation is publicly available.
منابع مشابه
Large-scale Quantitative Anonymity Assessment of Tor Path Selection Algorithms Against Structural Attacks
In this paper, we present a rigorous methodology for quantifying the anonymity provided by Tor against a variety of structural attacks, i.e., adversaries that corrupt Tor nodes and thereby perform eavesdropping attacks to deanonymize Tor users. First, we provide an algorithmic approach for computing the anonymity impact of such structural attacks against Tor. The algorithm is parametric in the ...
متن کاملImproving Tor security against timing and traffic analysis attacks with fair randomization
The Tor network is probably one of the most popular online anonymity systems in the world. It has been built based on the volunteer relays from all around the world. It has a strong scientific basis which is structured very well to work in low latency mode that makes it suitable for tasks such as web browsing. Despite the advantages, the low latency also makes Tor insecure against timing and tr...
متن کاملgPath: A Game-Theoretic Path Selection Algorithm to Protect Tor's Anonymity
In this paper, we address the problem of defending against entry-exit linking attacks in Tor, a popular anonymous communication system. We formalize the problem as a repeated non-cooperative game between the defender and the adversary (i.e., controller of the compromised Tor nodes to carry out entryexit linking attacks). Given the current path selection algorithm of Tor, we derive an optimal at...
متن کاملModified Relay Selection and Circuit Selection for Faster Tor
Users of the Tor anonymity system suffer from less-than-ideal performance, in part because circuit building and selection processes are not tuned for speed. In this paper, we examine both the process of selecting among pre-built circuits and the process of selecting the path of relays for use in building new circuits to improve performance while maintaining anonymity. First, we show that having...
متن کاملAnonymity in Tor-like systems under Timing Analysis: An Information Theoretic Perspective
“Tor does not provide protection against end-to-end timing attacks: If your attacker can watch the traffic coming out of your computer, and also the traffic arriving at your chosen destination, he can use statistical analysis to discover that they are part of the same circuit” http://www.torproject.org. Indeed, as first demonstrated in [1] and bolstered by many follow up studies since, timing a...
متن کامل